Synthesizing Probabilistic Composers
نویسندگان
چکیده
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This is in contrast to classical synthesis, where systems are always “constructed from scratch”. In the control-flow model of composition, exactly one component is in control at a given time and control is switched to another when the component reaches an exit state. The composition can then be described implicitly by a transducer, called a composer, which statically determines how the system transitions between components. Recently, Lustig, Nain and Vardi have shown that control-flow synthesis of deterministic composers from libraries of probabilistic components is decidable. In this work, we consider the more general case of probabilistic composers. We show that probabilistic composers are more expressive than deterministic composers, and that the synthesis problem still
منابع مشابه
Computer-Aided Orchestration Based on Probabilistic Instruments Models and Genetic Exploration
In this paper we introduce a tool aimed at assisting composers in orchestration tasks. Thanks to this tool, composers can specify a target sound and replicate it with a given orchestra. We discuss the problems raised by the realization of such a tool, concerning instrumental sound description and combinatorial optimization. Then we describe the solution adopted. We propose a machine learning me...
متن کاملUsing Fisher Kernels and Hidden Markov Models for the Identification of Famous Composers from their Sheet Music
We present a novel application of Fisher kernels to the problem of identifying famous composers from their sheet music. The characteristics of the composers writing style are obtained from note changes on a basic beat level, combined with the notes hidden harmony. We are able to extract this information by the application of a Hidden Markov Model to learn the underlying probabilistic structure ...
متن کاملProbabilistic Models for Local Patterns Analysis
Recently, many large organizations have multiple data sources (MDS’) distributed over different branches of an interstate company. Local patterns analysis has become an effective strategy for MDS mining in national and international organizations. It consists of mining different datasets in order to obtain frequent patterns, which are forwarded to a centralized place for global pattern analysis...
متن کاملMusical Composer Identification through Probabilistic and Feedforward Neural Networks
During the last decade many efforts for music information retrieval have been made utilizing Computational Intelligence methods. Here, we examine the information capacity of the Dodecaphonic Trace Vector for composer classification and identification. To this end, we utilize Probabilistic Neural Networks for the construction of a “similarity matrix” of different composers and analyze the Dodeca...
متن کاملA Decision-Theoretic Planning Approach to Synthesizing High-Quality Contract Anytime Algorithms
In this paper, we develop a decision-theoretic planning approach to synthesizing high-quality contract anytime algorithms. Anytime algorithms are considered as time-parameterized probabilistic actions. Given a set of primitive anytime algorithms and their performance prooles, the problem of synthesizing high-quality anytime algorithms is translated to a decision-theoretic planning problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012